全文获取类型
收费全文 | 1281篇 |
免费 | 140篇 |
国内免费 | 38篇 |
专业分类
化学 | 156篇 |
晶体学 | 4篇 |
力学 | 101篇 |
综合类 | 25篇 |
数学 | 713篇 |
物理学 | 460篇 |
出版年
2024年 | 3篇 |
2023年 | 8篇 |
2022年 | 29篇 |
2021年 | 29篇 |
2020年 | 32篇 |
2019年 | 17篇 |
2018年 | 22篇 |
2017年 | 38篇 |
2016年 | 46篇 |
2015年 | 37篇 |
2014年 | 104篇 |
2013年 | 91篇 |
2012年 | 70篇 |
2011年 | 80篇 |
2010年 | 81篇 |
2009年 | 98篇 |
2008年 | 76篇 |
2007年 | 105篇 |
2006年 | 65篇 |
2005年 | 59篇 |
2004年 | 38篇 |
2003年 | 56篇 |
2002年 | 42篇 |
2001年 | 29篇 |
2000年 | 21篇 |
1999年 | 20篇 |
1998年 | 25篇 |
1997年 | 19篇 |
1996年 | 17篇 |
1995年 | 8篇 |
1994年 | 6篇 |
1993年 | 5篇 |
1992年 | 7篇 |
1991年 | 7篇 |
1990年 | 7篇 |
1989年 | 4篇 |
1988年 | 7篇 |
1987年 | 4篇 |
1986年 | 9篇 |
1985年 | 13篇 |
1984年 | 4篇 |
1983年 | 1篇 |
1982年 | 4篇 |
1981年 | 8篇 |
1979年 | 4篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1974年 | 1篇 |
1972年 | 1篇 |
排序方式: 共有1459条查询结果,搜索用时 860 毫秒
11.
基于爆轰波原理声源定位方法初探 总被引:5,自引:0,他引:5
基于弹丸发射时所发出的爆轰波,利用传感器接收时差信息,从而确定声源位置。本文建立了该声源定位反问题的物理和数学模型,并依据该模型寻求适当的数值解法,最后针对延拓-广义逆法声源定位问题进行了演算和简要分析。 相似文献
12.
基于多站测向定位提供的目标辐射源方位角信息,提出了一种基于粒子滤波的测向定位跟踪算法.该算法采用序贯蒙特卡罗的粒子滤波技术,对目标辐射源方位信息进行粒子滤波融合处理,实现了对机动目标辐射源的无源定位跟踪.仿真实验表明,该算法适用于非线性模型和非高斯噪声的目标跟踪,与传统的基于卡尔曼滤波的多传感器融合跟踪算法相比,定位跟踪更为精确,从而对提高战场电子目标定位跟踪和精确打击具有广泛的应用价值. 相似文献
13.
Lina Mallozzi 《Operations Research Letters》2007,35(2):151-154
A noncooperative game theoretical approach is considered for the multifacility location problem. It turns out that the facility location game is a potential game in the sense of Monderer and Shapley and some properties of the game are studied. 相似文献
14.
15.
需求势能理论的配送中心选址方法的研究 总被引:4,自引:0,他引:4
物流配送中心选址的合理性直接影响着物流分销网络规划和优化.提出了针对物流网点选址的需求势能理论,并提出了一种基于需求势能的分销物流系统中配送中心的选址实现方法.最后通过实例证明,该方法简便快捷,结果正确合理,为解决此类配送中心选址问题提供了科学的指导依据. 相似文献
16.
Horst W. Hamacher Martine Labbé Stefan Nickel Anders J.V. Skriver 《Annals of Operations Research》2002,110(1-4):33-53
Locating a facility is often modeled as either the maxisum or the minisum problem, reflecting whether the facility is undesirable (obnoxious) or desirable. But many facilities are both desirable and undesirable at the same time, e.g., an airport. This can be modeled as a multicriteria network location problem, where some of the sum-objectives are maximized (push effect) and some of the sum-objectives are minimized (pull effect).We present a polynomial time algorithm for this model along with some basic theoretical results, and generalize the results also to incorporate maximin and minimax objectives. In fact, the method works for any piecewise linear objective functions. Finally, we present some computational results. 相似文献
17.
In this paper an extension of the (r|X
p
)-medianoid on networks introduced by Hakimi (1983) is studied. In this extension the customer considers not only the distance
but some characteristics of the facilities such as store size, quality of service and parking space. A new firm wants to establishr new facilities which have to compete with thep facilities that already exist in the market. The entry firm wants to find their locations and characteristics to maximize
profits. Three different customer choice rules (binary, partially binary and proportional preferences) are considered. Some
discretization results are obtained and a resolution procedure is proposed. The problem is solved combining a global search
algorithm based on a branch and bound procedure with some combinatorial heuristics (greedy, interchange, and tabu search).
Some computational experiences are presented.
Partially supported by Ministerio de Ciencia y Tecnología (Spain) and FEDER, grant BFM2002-04525-C02-01. 相似文献
18.
Ronald I. Becker Isabella Lari Andrea Scozzari Giovanni Storchi 《Annals of Operations Research》2007,150(1):65-78
In this paper we consider the location of a path shaped facility on a grid graph. In the literature this problem was extensively
studied on particular classes of graphs as trees or series-parallel graphs. We consider here the problem of finding a path
which minimizes the sum of the (shortest) distances from it to the other vertices of the grid, where the path is also subject
to an additional constraint that takes the form either of the length of the path or of the cardinality. We study the complexity
of these problems and we find two polynomial time algorithms for two special cases, with time complexity of O(n) and O(nℓ) respectively, where n is the number of vertices of the grid and ℓ is the cardinality of the path to be located.
The literature about locating dimensional facilities distinguishes between the location of extensive facilities in continuous
spaces and network facility location. We will show that the problems presented here have a close connection with continuous
dimensional facility problems, so that the procedures provided can also be useful for solving some open problems of dimensional
facilities location in the continuous case. 相似文献
19.
本文介绍利用景深短、高倍率、大口径的物镜,采用光学方法,对被测透镜上下表面调焦,从而测定其中心厚度的一种新方法,并对测量误差进行了探讨。 相似文献
20.
当分布密度的形式未知时,参数的极大似然估计没有明确的解析表达式,也不能通过设计算法由计算机运算得到。本文我们将从该分布中抽取的样本当作是来自另一个形式已知的分布密度的样本,该已知分布密度的选取依赖于未知的分布密度,但是具有与未知分布相似的边界性质。基于这两个分布族,我们提出了拟极大似然估计的概念,同时,对这种拟极大似然估计的渐近性质进行了讨论。结果表明拟极大拟然估计与极大似然估计有关相同的渐近性质,并且由于拟极大似然估计的获得不依赖于未知分布密度的形式,只与一已知的分布密度有关,使得通过计算机可以实现对其的求解。 相似文献